A Parallel Amg for Overlapping and Non-overlapping Domain Decomposition∗
نویسنده
چکیده
Abstract. There exist several approaches for the parallel solving of huge systems of linear equations resulting from the finite element (f.e.) discretization of 2nd order elliptic pdes. On the other hand, there exists a great demand for Algebraic Multigrid solvers (AMG) which have as input only matrix and right hand side or, as a substitute, the appropriate information per element. In this paper we propose a general parallel AMG algorithm using overlapping or non-overlapping data decompositions.
منابع مشابه
Parallel AMG on Distributed
Algebraic Multigrid (AMG) methods are well suited as preconditioners for iterative solvers of linear systems of equations which are sparse, symmetric positive deenite and stem from a nite element (FE) discretization of a 2 nd order elliptic partial diierential equation (PDE) or a system of PDEs. Since preconditioners based on AMG are very eecient, additional speedup can only be achieved by para...
متن کاملOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملA Robin-robin Non-overlapping Domain Decomposition Method for an Elliptic Boundary Control Problem
A Robin-Robin non-overlapping domain decomposition method for an optimal boundary control problem associated with an elliptic boundary value problem is presented. The existence of the whole domain and subdomain optimal solutions is proven. The convergence of the subdomain optimal solutions to the whole domain optimal solution is shown. The optimality system is derived and a gradient-type method...
متن کاملOverlapping Domain Decomposition Methods
Overlapping domain decomposition methods are efficient and flexible. It is also important that such methods are inherently suitable for parallel computing. In this chapter, we will first explain the mathematical formulation and algorithmic composition of the overlapping domain decomposition methods. Afterwards, we will focus on a generic implementation framework and its applications within Diff...
متن کاملParallel Incomplete Cholesky Preconditioners Based on the Non-Overlapping Data Distribution
The paper analyses various parallel incomplete factorizations based on the non-overlapping domain decomposition. The general framework is applied to the investigation of the preconditioning step in cg-like methods. Under certain conditions imposed on the nite element mesh, all matrix and vector types given by the special data distribution can be used in the matrix-by-vector multiplications. Not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000